#include<iostream>
#include<cstdio>
using namespace std;

double a, b, c, d;
int cnt = 3;
double f(double x)
{
    return a * x * x * x + b * x * x + c * x + d;
}
void binarySearch(double l, double r)
{
    while (r - l >= 0.0001)
    {
        double mid = (l + r) / 2.0;
        if (f(l) * f(mid) < 0)
            r = mid;
        else
            l = mid;
    }
    printf("%.2lf ", r);
}
int main()
{
    cin >> a >> b >> c >> d;
    for (double i = -100; i <= 100 && cnt != 0; i++)
    {
        if (f(i) == 0)
        {
            printf("%.2lf ", i);
            cnt--;
            continue;
        }
        else if (f(i) * f(i + 1) < 0) {
            binarySearch(i, i + 1);
            cnt--;
        }
    }
    return 0;
}